منابع مشابه
New Mersenne Number Transform Diffusion Power Analysis
Problem statement: Due to significant developments in the processing power and parallel processing technologies, the existing encryption algorithms are increasingly susceptible to attacks, such as side-channel attacks, for example. Designing new encryption algorithms that work efficiently on different platforms and security levels to protect the transmitted data from any possible attacks is one...
متن کاملRandom Number Generators with Period Divisible by a Mersenne Prime
Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of a Mersenne prime. These generators are based on “almost primitive” trinomials, that is trinomials ha...
متن کاملA Counterexample to a Result concerning Closure Operators
In 1960, José Morgado gave a necessary and sufficient condition on a poset P in order that closure operators on P , ordered pointwise, form a complete lattice. This result was based on a notion of relative quasi-infimum in posets. This note shows that Morgado’s result is flawed.
متن کاملA uniqueness result concerning a robust regularized least-squares solution
In solving a robust version of regularized least-squares with weighting, a certain scalar-valued optimization problem is required in order to determine the regularized robust solution and the corresponding robustified weighting parameters. This letter establishes that the required optimization problem does not have local, non-global minima over the interval of interest. This property is proved ...
متن کاملModular Number Systems: Beyond the Mersenne Family
In SAC 2003, J. Chung and A. Hasan introduced a new class of specific moduli for cryptography, called the more generalized Mersenne numbers, in reference to J. Solinas’ generalized Mersenne numbers proposed in 1999. This paper pursues the quest. The main idea is a new representation, called Modular Number System (MNS), which allows efficient implementation of the modular arithmetic operations r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1946
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1946-0015399-3